package Week5.J0513;

import java.util.Scanner;

public class 分割等和子集_xv {
    static int N = 510, M = 510 * 110 / 2;
    static int n;
    static int[] arr = new int[N];
    static boolean[][] dp = new boolean[N][M];

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        n = scanner.nextInt();
        int sum = 0;

        int[] nums = new int[n];

        for (int i = 1; i <= n; i++) {
            arr[i] = scanner.nextInt();
            sum += arr[i];
        }

        if (sum % 2 != 0) {
            System.out.println("false");
        } else {
            sum /= 2;
            dp[0][0] = true;
            for (int i = 1; i < n; i++) {
                for (int j = 0; j <= sum; j++) {
                    dp[i][j] = dp[i - 1][j];
                    if (j >= arr[i]) {
                        dp[i][j] = dp[i][j] || dp[i][j - arr[i]];
                    }
                }
            }
            if (dp[n][sum]) System.out.println("true");
            else System.out.println("false");
        }
    }
}
